Finite Domain and Cutting Plane Techniques in CLP(PB)
نویسندگان
چکیده
Finite domain constraints are one of the most important constraint domains in constraint logic programming. Usually, they are solved by local consistency techniques combined with enumeration. We argue that, in many cases, the concept of local consistency is too weak for both theoretical and practical reasons. We show how to obtain more information from a given constraint set by computing cutting planes and how to use this information in constraint solving and constrained optimization. Focusing on the pseudo-Boolean case CLP(PB), where all domains are equal to the two-element set {0, 1}, we present specialized cutting plane techniques and illustrate them on a number of examples.
منابع مشابه
Cutting Planes in Constraint Logic Programming
In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case o...
متن کاملOrr Sommerfeld Solver Using Mapped Finite Di?erence Scheme for Plane Wake Flow
Linear stability analysis of the three dimensional plane wake flow is performed using a mapped finite di?erence scheme in a domain which is doubly infinite in the cross–stream direction of wake flow. The physical domain in cross–stream direction is mapped to the computational domain using a cotangent mapping of the form y = ?cot(??). The Squire transformation [2], proposed by Squire, is also us...
متن کاملPlasticity Effect on Residual Stresses Measurement Using Contour Method
Residual stresses have become an important player in the field of the structural integrity for many years. Having an exact knowledge of residual stress distributions can be essential in designing the engineering components as unexpected failures are inevitable where such stresses are ignored. There are many residual stresses measurement techniques including destructive and non-destructive ones...
متن کاملPueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflictinduced learning. Novel features of our approa...
متن کاملMax-planck-institut F Ur Informatik Linear 0 -1 Inequalities and Extended Clauses K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Author's Address
Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...
متن کامل